Illumination decomposition for material recoloring with consistent interreflections
نویسندگان
چکیده
منابع مشابه
Illumination Decomposition for Material Recoloringith Consistent Interreflections
Changing the color of an object is a basic image editing operation, but a high quality result must also preserve natural shading. A common approach is to first compute reflectance and illumination intrinsic images. Reflectances can then be edited independently, and recomposed with the illumination. However, manipulating only the reflectance color does not account for diffuse interreflections, a...
متن کاملLearning of Optimal Illumination for Material Classification
We present a method to classify materials in illumination series data. An illumination series is acquired using a device which is capable to generate arbitrary lighting environments covering nearly the whole space of the upper hemisphere. The individual images of the illumination series span a high-dimensional feature space. Using a random forest classifier different materials, which vary in ap...
متن کاملConsistent Scene Illumination using a Chromatic Flash
Flash photography is commonly used in low-light conditions to prevent noise and blurring artifacts. However, flash photography commonly leads to a mismatch between scene illumination and flash illumination, due to the bluish light that flashes emit. Not only does this change the atmosphere of the original scene illumination, it also makes it difficult to perform white balancing because of the i...
متن کاملRecoloring Directed Graphs
Let G be a directed graph and k a positive integer. We define the k-color graph of G (Dk(G) for short) as the directed graph having all k-colorings of G as node set, and where two k-colorings β and φ are joined by a directed edge β → φ if φ is obtained from β by choosing a vertex v and recoloring v so that its color is different from the colors of all its out-neighbors. We investigate reachabil...
متن کاملOn Distributed Graph Coloring with Iterative Recoloring
Identifying the sets of operations that can be executed simultaneously is an important problem appearing in many parallel applications. By modeling the operations and their interactions as a graph, one can identify the independent operations by solving a graph coloring problem. Many efficient sequential algorithms are known for this NP-Complete problem, but they are typically unsuitable when th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2011
ISSN: 0730-0301,1557-7368
DOI: 10.1145/2010324.1964938